Randomization: beyond tossing a coin
نویسندگان
چکیده
1. Methods in Epidemiologic, Clinical and Operations Research–MECOR–program, American Thoracic Society/Asociación Latinoamericana del Tórax. Montevídeo, Uruguay. 2. Divisão de Pneumologia, Instituto do Coração – InCor – Hospital das Clínicas, Faculdade de Medicina, Universidade de São Paulo, São Paulo, Brasil. 3. Department of Preventive Medicine, Keck School of Medicine, University of Southern California, Los Angeles, CA, USA. INTRODUCTION
منابع مشابه
From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin-tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.
متن کاملShuffle randomization
In a randomized clinical trial, study participants are assigned to various treatment arms through randomization. This random allocation of participants to treatment arms decreases bias and controls for numerous confounders (1). A common type of randomization is simple randomization, where each participant is randomly assigned to a treatment arm with a known (usually equal) probability, regardle...
متن کاملCan Optimally-Fair Coin Tossing Be Based on One-Way Functions?
Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or halting the execution. Cleve [STOC’86] showed that in any r round coin tossing protocol one of the parties can bias the output by Ω(1/r) through a “fail-stop” attack; namely, they simply execute the prot...
متن کاملideal quantum coin tossing are impossible.
There had been well known claims of “provably unbreakable” quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and therefore coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wo...
متن کاملWhy quantum bit commitment and quantum coin tossing are impossible ? ∗
There had been well known claims of “provably unbreakable” quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wonder if se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 42 شماره
صفحات -
تاریخ انتشار 2016